Interval Representations of Cliques and of Subset Intersection Graphs
نویسندگان
چکیده
Constructions and bounds are given for the largest clique that can be represented as an intersection graph of intervals on the real line with bounded depth and multiplicity. Also, for the graph defined on the subsets of a set by putting vertices adjacent if and only if the corresponding subsets intersect, the interval number and boxicity are examined. Ke ywords: intersection graph, interval number, boxicity
منابع مشابه
dominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملInterval graphs and related topics
Interval graphs have engaged the interest of researchers for over twenty-five years. The scope of current research in this area now extends to the mathematical and algorithmic properties of interval graphs, their generalizations, and graph parameters motivated by them. One main reason for this increasing interest is that many real-world applications involve solving problems on graphs which are ...
متن کاملThe minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 Preliminaries Let F be a family of nonempty sets. The intersection graph of F is obtained by representing each set in F by a vertex and connecting two vertices by an edge if and only if their corresponding sets interse...
متن کاملA New Test for Interval Graphs
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a special class of chordal graphs. This class of graphs has a wide range of applications. Several linear time algorithms have been designed to recognize interval graphs. Booth & Lueker first used PQ-trees to recognize interval graphs in linear time. However, the data manipulation of PQ-trees is rather ...
متن کاملIntersection-Link Representations of Graphs
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and each edge (u, v) is represented by the intersection between R(u) and R(v), if it belongs to a dense subgraph, or by a curve connecting the boundaries ofR(u) andR(v), otherwise. We study a notion of plana...
متن کامل